一种求解混合多目标规划问题的功效函数法

逻辑生长函数相对于龚珀兹生长函数具有拐点高和对称性的特点,采用逻辑生长函数形式的功效函数法求解混合多目标规划问题具有形式简单、计算量小、符合实际的优点。证明了用这种方法求出的最优解是有效解。讨论了满意值对有效解的影响。逻辑生长函数还可以应用于多维变量评价的功效系数法中。     

Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory

In apparel industry, manufacturers developed standard allowed minutes (SAMs) databases on various manufacturing operations in order to facilitate better scheduling, while effective production schedules ensure smoothness of downstream operations. As apparel manufacturing environment is fuzzy and dynamic, rigid production schedules based on SAMs become futile in the presence of any uncertainty. In this paper, a fuzzification scheme is proposed to fuzzify the static standard time so as to incorporate some uncertainties, in terms of both job-specific and human related factors, into the fabric-cutting scheduling problem. A genetic optimisation procedure is also proposed to search for fault-tolerant schedules using genetic algorithms, such that makespan and scheduling uncertainties are minimised. Two sets of real production data were collected to validate the proposed method. Experimental results indicate that the genetically optimised fault-tolerant schedules not only improve the operation performance but also minimise the scheduling risks.     

Bases,spanning sets,and the axiom of choice

Two theorems are proved: First that the statement “there exists a field F such that for every vector space over F, every generating set contains a basis” implies the axiom of choice. This generalizes theorems of Halpern, Blass, and Keremedis. Secondly, we prove that the assertion that every vector space over ?₂ has a basis implies that every well‐ordered collection of two‐element sets has a choice function. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

压差式矢量水听器方位估计中的干扰抵消

矢量水听器由于能获取声场中标量（声压）和矢量（振速）信息，因此单个的矢量水听器就可实现目标方位估计。单个矢量水听器是利用信号的声压和质点振速之间相关性进行信号方位估计，但是当存在干扰，并且干扰和信号之间相关时，如果对运用能量流进行方位估计的方法不加改进，则会出现很大的误差，甚至出现错误的估计。本文提出一种存在已知噪声干扰情况下的干扰抵消方法，并针对该方法进行了仿真试验，最后运用湖试数据进行了验证。结果表明，该方法能有效地减弱相千千柑对信号的影响，实现对信号的方位估计。     

向量变分不等式的严格可行性问题

本篇文章首先定义了向量变分不等式的严格可行点概念,其次在假设了映射是强(D)-伪单调的情况下,证明了向量变分不等式解集非空有界与其严格可行点存在的等价性问题,推广了在数量变分不等式上得到的相应结果．     

Representations, convolution square roots and spherical vectors

We extend results on square integrable representations of a locally compact group to subrepresentations of a representations induced from a character of a closed subgroup. We do so working in the framework of quotient representations of ∗-algebras.     

Measurability criteria for fuzzy random vectors

Fuzzy random vector is a measurable map from a probability space to a collection of fuzzy vectors. Our aim in this paper is to discuss the measurability criteria for fuzzy random vectors, and show that under mild assumption, the measurability criteria for upper semicontinuous fuzzy random vectors can be expressed in several different but equivalent formulations. Finally, applying the obtained results, we resolve an open problem about the relationship between fuzzy random vectors and fuzzy random variables.     

Feature Selection using Fuzzy Support Vector Machines

The feature selection consists of obtaining a subset of these features to optimally realize the task without the irrelevant ones. Since it can provide faster and cost-effective learning machines and also improve the prediction performance of the predictors, it is a crucial step in machine learning. The feature selection methods using support machines have obtained satisfactory results, but the noises and outliers often reduce the performance. In this paper, we propose a feature selection approach using fuzzy support vector machines and compare it with the previous work, the results of experiments on the UCI data sets show that feature selection using fuzzy SVM obtains better results than using SVM.     

Adaptive application of operators in standard representation

Recently adaptive wavelet methods have been developed which can be shown to exhibit an asymptotically optimal accuracy/work balance for a wide class of variational problems including classical elliptic boundary value problems, boundary integral equations as well as certain classes of noncoercive problems such as saddle point problems. A core ingredient of these schemes is the approximate application of the involved operators in standard wavelet representation. Optimal computational complexity could be shown under the assumption that the entries in properly compressed standard representations are known or computable in average at unit cost. In this paper we propose concrete computational strategies and show under which circumstances this assumption is justified in the context of elliptic boundary value problems. Dedicated to Charles A. Micchelli on the occasion of his 60th birthday Mathematics subject classifications (2000) 41A25, 41A46, 65F99, 65N12, 65N55. This work has been supported in part by the Deutsche Forschungsgemeinschaft SFB 401, the first and third author are supported in part by the European Community's Human Potential Programme under contract HPRN-CT-202-00286 (BREAKING COMPLEXITY). The second author acknowledges the financial support provided through the European Union's Human Potential Programme, under contract HPRN-CT-2002-00285 (HASSIP) and through DFG grant DA 360/4–1.     

基于机器视觉的离散傅里叶变换目标识别方法

提出了一种基于机器视觉与离散傅里叶变换的目标特征识别方法。利用计算机图像技术采集和处理图像信号;利用离散的傅里叶变换对图像数据提取特征,能够更好的辨别数据细节,从而可通过图像的比对来实现目标的识别。该方法在对实际的静止图像进行处理与计算后,能够很好的对图像的细节变化进行识别。